t = int(input())
for _ in range(t):
n = int(input())
s = input()
v = 0
res = ""
val = False
for i in range(1, n):
if s[i] == '0':
res += "-"
continue
elif not val:
res += "-"
else:
res += "+"
val = not val
print(res)#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define _io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main()
{
_io;
ll T;
cin>>T;
while(T--)
{
ll n;
cin>>n;
string s;
cin>>s;
int sum=0;
string ans="";
for(int i=0;i<n;i++)
{
if(sum==0){ans=ans+'+';sum=sum+int(s[i])-int('0');}
else {ans=ans+'-';sum=sum-(int(s[i])-int('0'));}
//cout<<sum<<endl;
}
cout<<ans.substr(1,ans.size())<<endl;
}
}
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |